Statistical Topology via Morse Theory Persistence and Nonparametric Estimation
نویسندگان
چکیده
In this paper we examine the use of topological methods for multivariate statistics. Using persistent homology from computational algebraic topology, a random sample is used to construct estimators of persistent homology. This estimation procedure can then be evaluated using the bottleneck distance between the estimated persistent homology and the true persistent homology. The connection to statistics comes from the fact that when viewed as a nonparametric regression problem, the bottleneck distance is bounded by the sup-norm loss. Consequently, a sharp asymptotic minimax bound is determined under the sup–norm risk over Hölder classes of functions for the nonparametric regression problem on manifolds. This provides good convergence properties for the persistent homology estimator in terms of the expected bottleneck distance.
منابع مشابه
Statistical Topology Using the Nonparametric Density Estimation and Bootstrap Algorithm
This paper presents approximate confidence intervals for each function of parameters in a Banach space based on a bootstrap algorithm. We apply kernel density approach to estimate the persistence landscape. In addition, we evaluate the quality distribution function estimator of random variables using integrated mean square error (IMSE). The results of simulation studies show a significant impro...
متن کاملGrayscale and Color Image Segmentation using Computational Topology
In this paper, we present image segmentation algorithms based on tools from computational algebraic topology and Morse theory. We build our implementations on a very general clustering algorithm [4], developed by Chazal et al., which has been adapted for both grayscale and color image segmentation. By building up a simplicial complex incrementally filtering its simplices by values of a scalar f...
متن کاملVideo Segmentation using Morse-Smale Complexes
In this paper, we regard a space-time block of video data as a piecewise-linear 3-manifold, and we interpret video segmentation as the computation of the Morse-Smale complex for the block. In the generic case, this complex is a decomposition of space-time data into 3-dimensional cells shaped like crystals, and separated by quadrangular faces. The vertices of these are Morse critical points. In ...
متن کاملCombinatorial Construction of Morse - Smale Complexes
Scientific data is becoming increasingly complex, and sophisticated techniques are required for its effective analysis and visualization. The Morse-Smale complex is an efficient data structure that represents the complete gradient flow behavior of a scalar function, and can be used to identify, order, and selectively remove features. This dissertation presents two algorithms for constructing Mo...
متن کاملDiscrete Morse Theory for Computing Cellular Sheaf Cohomology
Sheaves and sheaf cohomology are powerful tools in computational topology, greatly generalizing persistent homology. We develop an algorithm for simplifying the computation of cellular sheaf cohomology via (discrete) Morse-theoretic techniques. As a consequence, we derive efficient techniques for distributed computation of (ordinary) cohomology of a cell complex.
متن کامل